Logical Closure Properties of Propositional Proof Systems
نویسنده
چکیده
In this paper we define and investigate basic logical closure properties of propositional proof systems such as closure of arbitrary proof systems under modus ponens or substitutions. As our main result we obtain a purely logical characterization of the degrees of schematic extensions of EF in terms of a simple combination of these properties. This result underlines the empirical evidence that EF and its extensions admit a robust definition which rests on only a few central concepts from propositional logic.
منابع مشابه
On the Correspondence between Arithmetic Theories and Propositional Proof Systems
Bounded arithmetic is closely related to propositional proof systems, and this relation has found many fruitful applications. The aim of this paper is to explain and develop the general correspondence between propositional proof systems and arithmetic theories, as introduced by Kraj́ıček and Pudlák [42]. Instead of focusing on the relation between particular proof systems and theories, we favour...
متن کاملOn the correspondence between arithmetic theories and propositional proof systems - a survey
Bounded arithmetic is closely related to propositional proof systems, and this relation has found many fruitful applications. The aim of this paper is to explain and develop the general correspondence between propositional proof systems and arithmetic theories, as introduced by Kraj́ıček and Pudlák [41]. Instead of focusing on the relation between particular proof systems and theories, we favour...
متن کاملA Propositional Proof System with Permutation Quantifiers
Propositional proof complexity is a field of theoretical computer science which concerns itself with the lengths of formal proofs in various propositional proof systems. Frege systems are an important class of propositional proof systems. Extended Frege augments them by allowing the introduction of new variables to abbreviate formulas. Perhaps the largest open question in propositional proof co...
متن کاملOn the Deduction Rule and the Number of Proof Lines
We introduce new proof systems for propositional logic, simple deduction Frege systems, general deduction Frege systems and nested deduction Frege systems, which augment Frege systems with variants of the deduction rule. We give upper bounds on the lengths of proofs in these systems compared to lengths in Frege proof systems. As an application we give a near-linear simulation of the proposition...
متن کاملA Sound and Complete Proof Theory for Propositional Logical Contingencies
There are simple, purely syntactic axiomatic proof systems for both the logical truths and the logical falsehoods of propositional logic. However, to date no such system has been developed for the logical contingencies, that is, formulas that are both satisfiable and falsifiable. This paper formalizes and purely syntactic axiomatic proof systems for the logical contingencies and proves its soun...
متن کامل